منابع مشابه
What is Ramsey-equivalent to a clique?
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H ′ are Ramsey-equivalent if every graph G is Ramsey for H if and only if it is Ramsey for H ′. In this paper, we study the problem of determining which graphs are Ramsey-equivalent to the complete graph Kk. A famous theorem of Nešetřil and Rödl implies that any graph H which ...
متن کاملRamsey Numbers of Connected Clique Matchings
We determine the Ramsey number of a connected clique matching. That is, we show that if G is a 2-edge-coloured complete graph on (r2− r− 1)n− r+ 1 vertices, then there is a monochromatic connected subgraph containing n disjoint copies of Kr for n sufficiently large. This number of vertices cannot be reduced.
متن کاملP-value: What is and what is not
The misinterpretation and misuse of p-value have been increasing for decades. In March 2016, the American Statistical Association released a statement to warn about the use and interpretation of p-value. In this study, we provided a definition and discussion of p-value and emphasized the importance of its accurate interpretation.
متن کاملWhat Is Applied Literature?
Applied literature is a term that is the outcome of a need to put literature to tangible uses in the “real” world. A medical practitioner looking for a definition of life, for instance, finds literature a useful source for the answer. With paradigm shifts in scientific studies, interdisciplinarity has been a method to overcome the alienations that resulted from the isolation of disciplines from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2014
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2014.06.003